Incremental approaches for updating approximations in set-valued ordered information systems
نویسندگان
چکیده
منابع مشابه
Incremental approaches for updating approximations in set-valued ordered information systems
Incremental learning is an efficient technique for knowledge discovery in a dynamic database, which enables acquiring additional knowledge from new data without forgetting prior knowledge. Rough set theory has been successfully used in information systems for classification analysis. Set-valued information systems are generalized models of single-valued information systems, which can be classif...
متن کاملSet-valued ordered information systems
Set-valued ordered information systems can be classified into two categories: disjunctive and conjunctive systems. Through introducing two new dominance relations to set-valued information systems, we first introduce the conjunctive/disjunctive set-valued ordered information systems, and develop an approach to queuing problems for objects in presence of multiple attributes and criteria. Then, w...
متن کاملOn Dominance Relations in Disjunctive Set-Valued Ordered Information Systems
Set-valued information systems are generalized models of single-valued information systems. Its semantic interpretation can be classified into two categories: disjunctive and conjunctive. We focus on the former in this paper. By introducing four types of dominance relations to the disjunctive set-valued information systems, we establish a dominance-based rough sets approach, which is mainly bas...
متن کاملDominance-based Rough Set Approach in Set- valued Ordered Information Systems
Set-valued information systems are generalized single-valued information systems. In this paper, by introducing a type of dominance relation to set-valued ordered information systems, we establish dominance-based rough set approach and propose a ranking approach for all objects based on the dominance classes. Furthermore, we discuss dominance rules, propose attribute reductions of consistent se...
متن کاملFuzzy rough approximations for set-valued data
Rough set theory is one of important tools of soft computing, and rough approximations are the essential elements in rough set models. However, the existing fuzzy rough set model for set-valued data, which is directly constructed based on a kind of similarity relation, fail to explicitly define fuzzy rough approximations. To solve this issue, in this paper, we propose two types of fuzzy rough a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Knowledge-Based Systems
سال: 2013
ISSN: 0950-7051
DOI: 10.1016/j.knosys.2013.06.013